Maximal Sublattices and Frattini Sublattices of Bounded Lattices

نویسندگان

  • M. E. Adams
  • Ralph Freese
چکیده

We will address these questions in order, and provide good partial answers, especially for nite lattices which are bounded homomorphic images of a free lattice. Recall that a nite lattice is bounded if and only if it can be obtained from the one element lattice by a sequence of applications of Alan Day's doubling construction for intervals. In particular, nite distributive lattices are bounded. On the other hand, we do not have a complete solution for any of the above problems. The main results of this paper can be summarized as follows. (1a) For any k > 0, there exists a nite lattice L which has more than jLj maximal sublattices. (1b) A nite bounded lattice L has at most jLj maximal sublattices. (2a) There exist arbitrarily large nite (or even countably in nite lattices) with a maximal sublattice S such that jSj = 14. (2b) For any " > 0, there exists a nite bounded lattice L with a maximal sublattice S such that jSj < "jLj. (3a) There exist in nitely many lattice varieties V such that every nite nontrivial lattice L 2 V is isomorphic to (L) for some nite lattice L 2 V. (3b) Every nite bounded lattice L can be represented as (K) for some nite bounded lattice K (not necessarily in V(L)).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Sublattices of Nite Distributive Lattices

Algebraic properties of lattices of quotients of nite posets are considered. Using the known duality between the category of all nite posets together with all order-preserving maps and the category of all nite distributive (0; 1)-lattices together with all (0; 1)-lattice ho-momorphisms, algebraic and arithmetic properties of maximal proper sublattices and, in particular, Frattini sublattices of...

متن کامل

Duality for Bounded Lattices

We present a duality theorem for bounded lattices that improves and strengthens Urquhart's topological representation for lattices. Rather than using maximal, disjoint lter-ideal pairs, as Urquhart does, we use all disjoint lter-ideal pairs. This allows not only for establishing a bijective correspondance between lattices and a certain kind of doubly ordered Stone Spaces (Urquhart), but for a f...

متن کامل

Sublattices of Topologically Represented Lattices

In [5], a representation of bounded lattices within so-called standard topological contexts has been developed. Based on the theory of formal concept analysis [14] it includes Stone’s representation of Boolean algebras by totally disconnected compact spaces [10], Priestley’s representation of bounded distributive lattices by totally order disconnected compact spaces [7] as well as Urquhardt’s r...

متن کامل

ar X iv : 1 21 0 . 05 71 v 1 [ m at h . M G ] 1 O ct 2 01 2 Well - rounded sublattices and coincidence site lattices

A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs). Furthermore, we count the number of well-rounded sublattices for several planar lattices and give their asymptotic behaviour.

متن کامل

Lattices That Are the Join of Two Proper Sublattices

Every lattice is the complete join of all its one-element sublattices. In this paper we address the question: Which lattices L have the property that L is finitely join reducible in SubL? That is, when do there exist proper sublattices A, B such that L = A∨B? In particular, could it be that every nontrivial lattice has this property, in which case every element of SubL would be finitely join re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997